The Hausdorff-Kuratowski hierarchy of ω-regular languages and a hierarchy of Muller automata
نویسندگان
چکیده
منابع مشابه
The Hausdorff-Kuratowski Hierarchy of omega-Regular Languages and a Hierarchy of Muller Automata
R. Barua, The Hausdorff-Kuratowski hierarchy of o-regular languages and a hierarchy of Muller automata, Theoretical Computer Science 96 (1992) 345-360. Given a finite alphabet Z, we give a simple characterization of those Gd subsets of Z” which are deterministic w-regular (i.e. accepted by Biichi automata) over Z and then characterize the w-regular languages in terms of these (rational) G6 sets...
متن کاملFine Hierarchy of Regular ω-Languages
By applying descriptive set theory to the Wagner’s fine structure of regular ω-languages we get quite different proofs of his results and obtain new results. We give an automata-free description of the fine structure. We present also a simple property of a deterministic Muller automaton equivalent to the condition that the corresponding regular ω-language belongs to any given level of the fine ...
متن کاملThe Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Bojańczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new class can be seen as a different way of generalizing the notion of regularity from finite to infinite words. This paper compares regular and max-regular languages in terms of topological complexity. It is proved that up to...
متن کاملFine Hierarchy of Regular w-Languages
Abst rac t By applying descriptive set theory we get several facts on the fine structure of regular w-languages considered by K.Wagner. We present quite different, shorter proofs for main his results and get new results. Our description of the fine structure is new, very clear and automata-free. We prove also a closure property of the fine structure under Boolean operations. Our results demonst...
متن کاملRecognizing ω-regular Languages with Probabilistic Automata
Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for ω-regular languages. Our main results are that our variant of probabilistic Büchi automata (PBA) is more expressive than non-deterministic ω-automata, but a certain subclass of PBA, called uniform PBA, has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90342-d